Fpga Implementation of Elliptic Curve Method for Factorization
نویسنده
چکیده
The security of the most popular asymmetric cryptographic scheme RSA depends on the hardness of factoring large numbers. The best known method for factorization large integers is the General Number Field Sieve (GNFS). One important step within the GNFS is the factorization of midsize numbers for smoothness testing, an efficient algorithm for which is the Elliptic Curve Method (ECM). We present an efficient hardware implementation of ECM to factor numbers up to 200 bits, which is also scalable to other bit lengths.
منابع مشابه
Optimized Implementation of the Elliptic Curve Factorization Method on a Highly Parallelized Hardware Cluster
In this thesis we present a highly efficient, parallel implementation of the elliptic curve method (ECM) on reconfigurable hardware in order to support the general number field sieve algorithm (GNFS). The GNFS is the most effective algorithm to factor large integers. It can be used to attack the RSA cryptosystem by factoring the composite RSA modulus N = p · q. During the sieving step, a large ...
متن کاملAn Efficient Hardware Architecture for Factoring Integers with the Elliptic Curve Method
The security of the most popular asymmetric cryptographic scheme RSA depends on the hardness of factoring large numbers. The best known method for this integer factorization is the General Number Field Sieve (GNFS). One important step within the GNFS is the factorization of mid-size numbers without small prime divisors. This can be done efficiently by the Elliptic Curve Method (ECM), e.g. in sp...
متن کاملFpga and Asic Implementation of Rho and P-1 Methods of Factoring
FPGA AND ASIC IMPLEMENTATION OF RHO AND P-1 METHODS OF FACTORING Ramakrishna Bachimanchi, MS George Mason University, 2007 Thesis Director: Dr. Kris Gaj One of the main challenges in the cryptography is breaking RSA-1024. The problem can be explained as factoring large integers. The suitable methods for this purpose are Multiple Polynomial Quadratic Sieve (MPQS) and Number Field Sieve (NFS). Ou...
متن کاملFast point multiplication on Koblitz curves: Parallelization method and implementations
Point multiplication is required in every elliptic curve cryptosystem and its efficient implementation is essential. Koblitz curves are a family of curves defined over F2m allowing notably faster computation. We discuss implementation of point multiplication on Koblitz curves with parallel field multipliers. We present a novel parallelization method utilizing point operation interleaving. FPGA ...
متن کاملAn FPGA Implementation of an Elliptic Curve Processor over
This paper describes a hardware implementation of an arithmetic processor which is efficient for elliptic curve (EC) cryptosystems, which are becoming increasingly popular as an alternative for public key cryptosystems based on factoring. The modular multiplication is implemented using a Montgomery modular multiplication in a systolic array architecture, which has the advantage that the clock f...
متن کامل